On Off-Diagonal Ordered Ramsey Numbers of Nested Matchings
نویسندگان
چکیده
For two ordered graphs \(G^<\) and \(H^<\), the Ramsey number \(r_<(G^<,H^<)\) is minimum N such that every red-blue coloring of edges complete graph \(K^<_N\) contains a red copy or blue \(H^<\).
منابع مشابه
Off-diagonal hypergraph Ramsey numbers
The Ramsey number rk(s, n) is the minimum N such that every red-blue coloring of the k-subsets of {1, . . . , N} contains a red set of size s or a blue set of size n, where a set is red (blue) if all of its k-subsets are red (blue). A k-uniform tight path of size s, denoted by Ps, is a set of s vertices v1 < · · · < vs in Z, and all s−k+1 edges of the form {vj , vj+1, . . . , vj+k−1}. Let rk(Ps...
متن کاملOrdered Ramsey numbers of loose paths and matchings
For a k-uniform hypergraph G with vertex set {1, . . . , n}, the ordered Ramsey number ORt(G) is the least integer N such that every t-coloring of the edges of the complete k-uniform graph on vertex set {1, . . . , N} contains a monochromatic copy of G whose vertices follow the prescribed order. Due to this added order restriction, the ordered Ramsey numbers can be much larger than the usual gr...
متن کاملConstructive lower bounds for off-diagonal Ramsey numbers
We describe an explicit construction which, for some fixed absolute positive constant ε, produces, for every integer s > 1 and all sufficiently large m, a graph on at least m √ log s/ log log s vertices containing neither a clique of size s nor an independent set of size m.
متن کاملOrdered Ramsey numbers
Given a labeled graph H with vertex set {1, 2, . . . , n}, the ordered Ramsey number r<(H) is the minimum N such that every two-coloring of the edges of the complete graph on {1, 2, . . . , N} contains a copy of H with vertices appearing in the same order as in H. The ordered Ramsey number of a labeled graph H is at least the Ramsey number r(H) and the two coincide for complete graphs. However,...
متن کاملRamsey numbers of ordered graphs
An ordered graph G< is a graph G with vertices ordered by the linear ordering <. The ordered Ramsey number R(G<, c) is the minimum number N such that every ordered complete graph with c-colored edges and at least N vertices contains a monochromatic copy of G<. For unordered graphs it is known that Ramsey numbers of graphs with degrees bounded by a constant are linear with respect to the number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends in mathematics
سال: 2021
ISSN: ['2297-024X', '2297-0215']
DOI: https://doi.org/10.1007/978-3-030-83823-2_38